Minimal average degree aberration and the state polytope for experimental designs
نویسندگان
چکیده
منابع مشابه
Minimal average degree aberration and the state polytope for experimental designs
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Gröbner bases provide a systematic way of doing this. The algebraic method does not, in general, produce all estimable models but it can be shown that it yields models which have minimal average degree in a well-defined sense...
متن کاملContents December 10 ( Wed . ) 1 1 MINIMAL AVERAGE DEGREE ABERRATION AND THE STATE POLYTOPE FOR EXPER - IMENTAL DESIGNS —
s of Workshop on Computational Algebraic Statistics, Theories and Applications December 10-11, 2008 Kyoto, Japan CASTA2008 Supported by JSPS Grants-in-Aid for Scientific Research No.18200019, No. 20340021, and The Institute of Statistical Mathematics
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملMinimum Moment Aberration for Nonregular Designs and Supersaturated Designs
A novel combinatorial criterion, called minimum moment aberration, is proposed for assessing the goodness of nonregular designs and supersaturated designs. The new criterion, which is to sequentially minimize the power moments of the number of coincidences among runs, is a surrogate with tremendous computational advantages for many statistically justified criteria, such as minimum G2aberration,...
متن کاملThe Polytope of Degree Partitions
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. Let DP(n) (respectively, DS(n)) denote the convex hull of all degree partitions (respectively, degree sequences) of simple graphs on the vertex set [n] = {1, 2, . . . , n}. We think of DS(n) as the symmetrization of DP(n) and DP(n) as the asymmetric part of DS(n). The polytope DS(n) is a well st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of the Institute of Statistical Mathematics
سال: 2010
ISSN: 0020-3157,1572-9052
DOI: 10.1007/s10463-010-0291-8